NSF PAR Search | NSF Public Access Repository

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

A scalable and robust variance components method reveals insights into the architecture of gene-environment interactions underlying complex traits

https://doi.org/10.1016/j.ajhg.2024.05.015

Pazokitoroudi, Ali; Liu, Zhengtong; Dahl, Andrew; Zaitlen, Noah; Rosset, Saharon; Sankararaman, Sriram (July 2024, The American Journal of Human Genetics)

Full Text Available
Surprises in high-dimensional ridgeless least squares interpolation

https://doi.org/10.1214/21-AOS2133

Hastie, Trevor; Montanari, Andrea; Rosset, Saharon; Tibshirani, Ryan J. (April 2022, The Annals of Statistics)

Full Text Available
Cell-type-specific resolution epigenetics without the need for cell sorting or single-cell biology

https://doi.org/10.1038/s41467-019-11052-9

Rahmani, Elior; Schweiger, Regev; Rhead, Brooke; Criswell, Lindsey A.; Barcellos, Lisa F.; Eskin, Eleazar; Rosset, Saharon; Sankararaman, Sriram; Halperin, Eran (December 2019, Nature Communications)

Full Text Available
The Everlasting Database: Statistical Validity at a Fair Price

Woodworth, Blake; Feldman, Vitaly; Rosset, Saharon; Srebro, Nathan (January 2018, Advances in neural information processing systems)

The problem of handling adaptivity in data analysis, intentional or not, permeates a variety of fields, including test-set overfitting in ML challenges and the accumulation of invalid scientific discoveries. We propose a mechanism for answering an arbitrarily long sequence of potentially adaptive statistical queries, by charging a price for each query and using the proceeds to collect additional samples. Crucially, we guarantee statistical validity without any assumptions on how the queries are generated. We also ensure with high probability that the cost for M non-adaptive queries is O(log M), while the cost to a potentially adaptive user who makes M queries that do not depend on any others is O(sqrt(M)).
more » « less
Full Text Available
Detecting heritable phenotypes without a model using fast permutation testing for heritability and set-tests

https://doi.org/10.1038/s41467-018-07276-w

Schweiger, Regev; Fisher, Eyal; Weissbrod, Omer; Rahmani, Elior; Müller-Nurasyid, Martina; Kunze, Sonja; Gieger, Christian; Waldenberger, Melanie; Rosset, Saharon; Halperin, Eran (December 2018, Nature Communications)

Full Text Available
RL-SKAT: An Exact and Efficient Score Test for Heritability and Set Tests

https://doi.org/10.1534/genetics.117.300395

Schweiger, Regev; Weissbrod, Omer; Rahmani, Elior; Müller-Nurasyid, Martina; Kunze, Sonja; Gieger, Christian; Waldenberger, Melanie; Rosset, Saharon; Halperin, Eran (October 2017, Genetics)

Full Text Available

Search for: All records